Speeding Up Algorithms on Compressed Web Graphs
نویسندگان
چکیده
منابع مشابه
Speeding up Compressed Matching with SBNDM2
We consider a compression scheme for natural-language texts and genetic data. The method encodes characters with variable-length codewords of k-bit base symbols. We present a new search algorithm, based on the SBNDM2 algorithm, for this encoding. The results of practical experiments show that the method supersedes the previous comparable methods in search speed.
متن کاملSpeeding Up q-Gram Mining on Grammar-Based Compressed Texts
We present an efficient algorithm for calculating q-gram frequencies on strings represented in compressed form, namely, as a straight line program (SLP). Given an SLP T of size n that represents string T , the algorithm computes the occurrence frequencies of all q-grams in T , by reducing the problem to the weighted q-gram frequencies problem on a trie-like structure of size m = |T | − dup(q, T...
متن کاملSpeeding Up Shortest Path Algorithms
Given an arbitrary, non-negatively weighted, directed graph G = (V,E) we present an algorithm that computes all pairs shortest paths in time O(mn + m lg n + nTψ(m , n)), where m is the number of different edges contained in shortest paths and Tψ(m , n) is a running time of an algorithm to solve a single-source shortest path problem (SSSP). This is a substantial improvement over a trivial n time...
متن کاملSpeeding Up Dynamic Shortest-Path Algorithms
Dynamic shortest path algorithms update the shortest paths to take into account a change in an edge weight. This paper describes a new technique that allows the reduction of heap sizes used by several dynamic shortest path algorithms. For unit weight change, the updates can be done without heaps. These reductions almost always reduce the computational times for these algorithms. In computationa...
متن کاملAn effective Procedure for Speeding up Algorithms
The provably asymptotically fastest algorithm within a factor of 5 for formally described problems will be constructed. The main idea is to enumerate all programs provably equivalent to the original problem by enumerating all proofs. The algorithm could be interpreted as a generalization and improvement of Levin search, which is, within a multiplicative constant, the fastest algorithm for inver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2009
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2009.10390646